The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, a new two-sided U-type assembly line balancing (TUALB) procedure and a new algorithm based on the particle swarm optimization algorithm to solve the TUALB problem are proposed. The proposed approach minimizes the number of stations for a given cycle time as the primary objective and it minimizes the number of positions as a secondary objective. The proposed approach is illustrated with...
Minimizing the distance between search direction matrix of the Dai–Liao method and the scaled memoryless BFGS update in the Frobenius norm, and using Powell’s nonnegative restriction of the conjugate gradient parameters, a one-parameter class of nonlinear conjugate gradient methods is proposed. Then, a brief global convergence analysis is made with and without convexity assumption on the objective...
In this paper we study the continuous-time Markov decision processes with a denumerable state space, a Borel action space, and unbounded transition and cost rates. The optimality criterion to be considered is the finite-horizon expected total cost criterion. Under the suitable conditions, we propose a finite approximation for the approximate computations of an optimal policy and the value function,...
Seaborne trade is the lynchpin in almost every international supply chain, and about 90% of non-bulk cargo worldwide is transported by container. In this survey we give an overview of data-driven optimization problems in liner shipping. Research in liner shipping is motivated by a need for handling still more complex decision problems, based on big data sets and going across several organizational...
Third order dual of a primal nonlinear programming problem is established which involves the third order derivatives of the functions constituting the primal problem. Desired duality theorems are provided for the pair of primal and the corresponding third order dual problem. Numerical examples are illustrated to justify the efficiency of the proposed method. It is also observed that some of the existing...
This paper addresses the channel coordination problem in a green supply chain consisting of a manufacturer and a retailer, in which the manufacturer controls green innovation and wholes price, while the retailer controls sales price. Pricing and green innovation strategies in integrated and decentralized channels are computed and compared, and a two-part tariff contract is designed to coordinate the...
In this paper, we deal with single machine scheduling problems subject to time dependent effects. The main point in our models is that we do not assume a constant processing rate during job processing time. Rather, processing rate changes according to a fixed schedule of activities, such as replacing a human operator by a less skilled operator. The contribution of this paper is threefold. First, we...
In this paper, we study the problem of establishing a dynamic charging schedule of electric vehicles (EVs) at a charging station, assuming that limited power implies that only a limited number of EVs can charge simultaneously. The only control we assume to be available to the charging station is the ability to (at any given time) turn on or off the power supply to any EV, with this tool we want to...
We use game theory techniques to automatically compute improved lower bounds on the competitive ratio for the bin stretching problem. Using these techniques, we improve the best lower bound for this problem to 19/14. We explain the technique and show that it can be generalized to compute lower bounds for any online or semi-online packing or scheduling problem.
In this paper, we propose an infeasible interior-point algorithm for linear complementarity problems. In every iteration, the algorithm constructs an ellipse and searches an $$\varepsilon $$ ε -approximate solution of the problem along the ellipsoidal approximation of the central path. The theoretical iteration-complexity of the algorithm is derived and the algorithm is proved to be polynomial...
In this paper, we consider the semi-online hierarchical scheduling for load balancing on two identical machines. In the problem, the jobs are available online over list and the objective is to minimize the $$l_p$$ l p -norm of the two machines’ loads. Two semi-online versions are investigated: the buffer version and the rearrangement version. We design a unified optimal semi-online algorithm...
This paper is dedicated to the investigation of a new numerical method to approximate the optimal stopping problem for a discrete-time continuous state space Markov chain under partial observations. It is based on a two-step discretization procedure based on optimal quantization. First, we discretize the state space of the unobserved variable by quantizing an underlying reference measure. Then we...
This paper reviews the state-of-the-art in the theory of deterministic and uncertain linear semi-infinite optimization, presents some numerical approaches to this type of problems, and describes a selection of recent applications in a variety of fields. Extensions to related optimization areas, as convex semi-infinite optimization, linear infinite optimization, and multi-objective linear semi-infinite...
Recently, Luc defined a dual program for a multiple objective linear program. The dual problem is also a multiple objective linear problem and the weak duality and strong duality theorems for these primal and dual problems have been established. Here, we use these results to prove some relationships between multiple objective linear primal and dual problems. We extend the available results on single...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.